1

On scheduling cycle shops: classification, complexity and approximation

Year:
2002
Language:
english
File:
PDF, 354 KB
english, 2002
4

Margining option portfolios by network flows

Year:
2012
Language:
english
File:
PDF, 291 KB
english, 2012
5

Non-similarity combinatorial problems

Year:
1993
Language:
english
File:
PDF, 733 KB
english, 1993
6

Shortest consistent superstrings computable in polynomial time

Year:
1995
Language:
english
File:
PDF, 649 KB
english, 1995
10

Is a unit-time job shop not easier than identical parallel machines?

Year:
1998
Language:
english
File:
PDF, 875 KB
english, 1998
14

Ideal preemptive schedules on two processors

Year:
2003
Language:
english
File:
PDF, 201 KB
english, 2003
19

String Noninclusion Optimization Problems

Year:
1998
Language:
english
File:
PDF, 355 KB
english, 1998
20

How small are shifts required in optimal preemptive schedules?

Year:
2015
Language:
english
File:
PDF, 449 KB
english, 2015